Variable Genetic Operator Search for the Molecular Docking Problem

نویسندگان

  • Salma Mesmoudi
  • Jorge Tavares
  • Laetitia Vermeulen-Jourdan
  • El-Ghazali Talbi
چکیده

The aim of this work is to present a new hybrid algorithm for the Molecular Docking problem: Variable Genetic Operator Search (VGOS). The proposed method combines an Evolutionary Algorithm with Variable Neighborhood Search. Experimental results show that the algorithm is able to achieve good results, in terms of energy optimization and RMSD values for several molecules when compared with previous approaches. In addition, when hybridized with the L-BFGS local search method it attains very competitive results.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modeling the Time Windows Vehicle Routing Problem in Cross-Docking Strategy Using Two Meta-Heuristic Algorithms

   In cross docking strategy, arrived products are immediately classified, sorted and organized with respect to their destination. Among all the problems related to this strategy, the vehicle routing problem (VRP) is very important and of special attention in modern technology. This paper addresses the particular type of VRP, called VRPCDTW, considering a time limitation for each customer/retai...

متن کامل

On the Efficiency of Local Search Methods for the Molecular Docking Problem

Evolutionary approaches to molecular docking typically hybridize with local search methods, more specifically, the Solis-Wet method. However, some studies indicated that local search methods might not be very helpful in the context of molecular docking. An evolutionary algorithm with proper genetic operators can perform equally well or even outperform hybrid evolutionary approaches. We show tha...

متن کامل

A hybrid metaheuristic using fuzzy greedy search operator for combinatorial optimization with specific reference to the travelling salesman problem

We describe a hybrid meta-heuristic algorithm for combinatorial optimization problems with a specific reference to the travelling salesman problem (TSP). The method is a combination of a genetic algorithm (GA) and greedy randomized adaptive search procedure (GRASP). A new adaptive fuzzy a greedy search operator is developed for this hybrid method. Computational experiments using a wide range of...

متن کامل

A Novel Experimental Analysis of the Minimum Cost Flow Problem

In the GA approach the parameters that influence its performance include population size, crossover rate and mutation rate. Genetic algorithms are suitable for traversing large search spaces since they can do this relatively fast and because the mutation operator diverts the method away from local optima, which will tend to become more common as the search space increases in size. GA’s are base...

متن کامل

A comparative QSAR analysis, molecular docking and PLIF studies of some N-arylphenyl-2,2-dichloroacetamide analogues as anticancer agents

Dichloroacetate (DCA) is a simple and small anticancer drug that arouses the activity of the enzyme pyruvate dehydrogenase (PDH) through inhibition of the enzyme pyruvate dehydrogenase kinases (PDK1-4). DCA can selectively promote mitochondria-regulated apoptosis, depolarizing the hyperpolarized inner mitochondrial membrane potential to normal levels, inhibit tumor growth and reduce proliferati...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010